existentially quantified

См. также в других словарях:

• True quantified Boolean formula — The language TQBF is a formal language in computer science that contains True Quantified Boolean Formulas. A fully quantified boolean formula is a formula in first order logic where every variable is quantified (or bound), using either… …   Wikipedia

• Skolem normal form — A formula of first order logic is in Skolem normal form (named after Thoralf Skolem) if it is in conjunctive prenex normal form with only universal first order quantifiers. Every first order formula can be converted into Skolem normal form while… …   Wikipedia

• Alternating Turing machine — In computational complexity theory, an alternating Turing machine (ATM) is a non deterministic Turing machine (NTM) with a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co NP.… …   Wikipedia

• Herbrandization — The Herbrandization of a logical formula (named after Jacques Herbrand) is a construction that is dual to the Skolemization of a formula. Thoralf Skolem had considered the Skolemizations of formulas in prenex form as part of his proof of the… …   Wikipedia

• Conjunctive query — In database theory, a conjunctive query is a restricted form of first order queries. A large part of queries issued on relational databases can be written as conjunctive queries, and large parts of other first order queries can be written as… …   Wikipedia

• 2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …   Wikipedia

• Theory of descriptions — The theory of descriptions is one of the philosopher Bertrand Russell s most significant contributions to the philosophy of language. It is also termed Russell s Theory of Descriptions (often abbreviated as RTD ). In short, Russell argued that… …   Wikipedia

• Morse–Kelley set theory — In the foundation of mathematics, Morse–Kelley set theory (MK) or Kelley–Morse set theory (KM) is a first order axiomatic set theory that is closely related to von Neumann–Bernays–Gödel set theory (NBG). While von Neumann–Bernays–Gödel set theory …   Wikipedia

• Empty domain — In first order logic the empty domain is the empty set having no members. In traditional and classical logic domains are restrictedly non empty in order that certain theorems be valid. Interpretations with an empty domain are shown to be a… …   Wikipedia

• Formula game — A formula game is an artificial game represented by a fully quantified Boolean formula. Players turns alternate and the space of possible moves is denoted by bound variables. If a variable is universally quantified, the formula following it has… …   Wikipedia

• Attempto Controlled English — (ACE) is a controlled natural language, i.e. a subset of standard English with a restricted syntax and a restricted semantics described by a small set of construction and interpretation rules [cite conference | author = Norbert E. Fuchs, Kaarel… …   Wikipedia